A Term Rewriting Technique for Decision Graphs
نویسنده
چکیده
We provide an automatic verification for a fragment of FOL quantifier-free logic with zero, successor and equality. We use BDD representation of such formulas and to verify them, we first introduce a (complete) term rewrite system to generate an equivalent Ordered (0, S,=)-BDD from any given (0, S,=)-BDD. Having the ordered representation of the BDDs, one can verify the original formula in constant time. Then, to have this transformation automatically, we provide an algorithm which will do the whole process.
منابع مشابه
Critical Pairs in Term Graph Rewriting
Term graphs represent functional expressions such that common subexpressions can be shared, making expression evaluation more efficient than with strings or trees. Rewriting of term graphs proceeds by both applications of term rewrite rules and folding steps which enhance the degree of sharing. The present paper introduces critical pairs in term graph rewriting and establishes a Critical Pair L...
متن کاملInfinitary rewriting and cyclic graphs
Innnitary rewriting allows innnitely large terms and innnitely long reduction sequences. There are two computational motivations for studying these: the innnite data structures implicit in lazy functional programming, and the use of rewriting of possibly cyclic graphs as an implementation technique for functional languages. We survey the fundamental properties of innnitary rewriting in orthogon...
متن کاملModes of Convergence for Term Graph Rewriting
Term graph rewriting provides a simple mechanism to finitely represent restricted forms of infinitary term rewriting. The correspondence between infinitary term rewriting and term graph rewriting has been studied to some extent. However, this endeavour is impaired by the lack of an appropriate counterpart of infinitary rewriting on the side of term graphs. We aim to fill this gap by devising tw...
متن کاملOrderal Term Rewriting Systems
This article describes a generalization of term rewriting system technique used as a basis for decision algorithm for equational theories. The or-deral term rewriting system technique is presented. The main innovation of the proposed technique is that reductions according to some rules of such a system are performed only if special restrictions are satissed. The restrictions are based on term o...
متن کاملUniication, Rewriting, and Narrowing on Term Graphs 1
The concept of graph substitution recently introduced by the authors is applied to term graphs, yielding a uniform framework for uniication, rewriting, and narrowing on term graphs. The notion of substitution allows deenitions of these concepts that are close to the corresponding deenitions in the term world. The rewriting model obtained in this way is equivalent to \collapsed tree rewriting" a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 253 شماره
صفحات -
تاریخ انتشار 2009